منابع مشابه
Open Problems from CCCG 2006
An edge reconnection is an operation on a path of three consecutive vertices (a, b, c) of a chain or tree linkage; refer to Figure 1. If it is possible to fold the linkage, preserving edge lengths and avoiding self-intersection, to bring the two incident edges ab and bc into coincidence, then the edge reconnection breaks the connection between the edges at b, splits b into two vertices b1 and b...
متن کاملEditorial: special issue on WeB 2006
This ISeB special issue on e-business is based on a selected set of best papers presented in the Fifth International Workshop on e-Business (WeB), an International Conference on Information Systems (ICIS) workshop event held in Milwaukee, WI, in December 2006, with main sponsorship from the AIS Special Interest Group on E-Business. The papers in this special issue provide a snapshot of the rapi...
متن کاملOpen problems from cccg 2001
Refer to Figure 1. A monotone matching is a set of n segments, each the portion of a unique pseudoline, and each spanning a unique slab, such that the left endpoint of each segment is above the right endpoint of the segment in the previous slab. In addition, the point on the first vertical line is below the left endpoint of the first segment, and the point on the last vertical line is above the...
متن کاملOpen Problems from CCCG 2014
This report provides the problems posed by the participants at the open problem session of the 26 Canadian Conference on Computational Geometry. This well-attended session was held Tuesday, August 12, 2014, as a scheduled session of the conference. Six participants presented a total of seven problems. All presenters kindly agreed to provide written versions of their problems, including referenc...
متن کاملCCCG 2013 , Waterloo , Ontario
In this paper, we show that the θ-graph with three cones is connected. We also provide an alternative proof of the connectivity of the Yao-graph with three cones.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2009
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2008.12.004